منابع مشابه
Multiplicative Monotone Convolutions
Recently, Bercovici has introduced multiplicative convolutions based on Muraki’s monotone independence and shown that these convolution of probability measures correspond to the composition of some function of their Cauchy transforms. We provide a new proof of this fact based on the combinatorics of moments. We also give a new characterisation of the probability measures that can be embedded in...
متن کاملStochastic evolution equations with multiplicative Poisson noise and monotone nonlinearity
Semilinear stochastic evolution equations with multiplicative Poisson noise and monotone nonlinear drift in Hilbert spaces are considered. The coefficients are assumed to have linear growth. We do not impose coercivity conditions on coefficients. A novel method of proof for establishing existence and uniqueness of the mild solution is proposed. Examples on stochastic partial differentia...
متن کاملContinuous dependence on coefficients for stochastic evolution equations with multiplicative Levy Noise and monotone nonlinearity
Semilinear stochastic evolution equations with multiplicative L'evy noise are considered. The drift term is assumed to be monotone nonlinear and with linear growth. Unlike other similar works, we do not impose coercivity conditions on coefficients. We establish the continuous dependence of the mild solution with respect to initial conditions and also on coefficients. As corollaries of ...
متن کاملGENERALIZED POSITIVE DEFINITE FUNCTIONS AND COMPLETELY MONOTONE FUNCTIONS ON FOUNDATION SEMIGROUPS
A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...
متن کاملOn Learning Monotone Boolean Functions
Abstract We consider the problem of learning monotone Boolean functions over under the uniform distribution. Specifically, given a polynomial number of uniform random samples for an unknown monotone Boolean function , and given polynomial computing time, we would like to approximate as well as possible. We describe a simple algorithm that we prove achieves error at most , improving on the previ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1953
ISSN: 0002-9939
DOI: 10.2307/2032521